Improved Techniques for Fast Exponentiation
نویسنده
چکیده
We present improvements to algorithms for efficient exponentiation. The fractional window technique is a generalization of the sliding window and window NAF approach; it can be used to improve performance in devices with limited storage. Window NAF splitting is an efficient technique for exponentiation with precomputation for fixed bases in groups where inversion is easy (e.g. elliptic curves).
منابع مشابه
The Consistency Analysis of Addition Chains for Several Fast Algorithm of Modular Exponentiation
Modular exponentiation is the most frequently used and time-cost part in RSA, its fast algorithm is one of the focuses of RSA study, and to speed up the computation of modular exponentiation is most important to the performance and wide use of RSA. This paper studies Qin Jiu-shao algorithm, Blocking algorithm, Addition Chains algorithm, and Adaptive Binary Partition Table Searching Method. Anot...
متن کاملImproved Exponentiation and Key Agreement in the Infrastructure of a Real Quadratic Field
We describe improvements to the performance of a key agreement protocol based in the infrastructure of a real quadratic field through investigating fast methods for exponentiating ideals. We present adaptations of non-adjacent form and signed base-3 exponentiation and compare these to the binary method. To adapt these methods, we introduce new algorithms for squaring, cubing, and dividing w-nea...
متن کاملHow to Maximize the Potential of FPGA-Based DSPs for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation architecture proposed by us comprises three main techniques. The first one is to improve the Montgomery multiplication algorithm in order to maximize the performance of the multiplication unit in an FPGA. The second one i...
متن کاملDesign and Implementation of Fast Multiplication Algorithms in Public Key Cryptosystems for Smart Cards
Most practical public-key cryptosystems are based on modular exponentiation. A modular exponentiation is composed of repeated modular multiplications. Several methods have been proposed to reduce the execution time of a modular exponentiation, essentially aiming to reduce the execution time of each modular multiplication. The goal of this paper is to investigate three different integer multipli...
متن کاملHow to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation architecture proposed by us comprises three main techniques. The first technique is to improve the Montgomery multiplication algorithm in order to maximize the performance of the multiplication unit in FPGA. The second te...
متن کامل